Search results for "Generic programming"

Generics: Ada 95 vs. C++ vs. Java 1.5

2005

Exacus: Efficient and Exact Algorithms for Curves and Surfaces

2005

We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.

Reverse inheritance in statically typed object-oriented programming languages

2010

Reverse inheritance is a new class reuse mechanism, an experimental implementation of which we have built for Eiffel. It enables a more natural design approach, factorization of common features (members), insertion of classes into an existing hierarchy etc. Due to its reuse potential in Eiffel we consider exploring its capabilities in other industrial-strength programming languages like C++, Java and C#.

Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere

2009

AbstractThis paper presents a cgal kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non-trivial predicates are presented. Second, the design of the kernel concept is developed, and the connexion between the mathematics and this design is established. In particular, we show how two different frameworks can be combined: one for the general setting, and one dedicated to the case where all the objects handled lie on a reference sphere. Finally, an assessment about the efficacy of the 3D Spherical Kernel is made through the calculation of the exact arrangement of circles on a sphere. On average w…

Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere

2009

International audience; This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates are presented. Second, the design of the kernel concept is developed, and the connexion between the mathematics and this design is established. In particular, we show how two different frameworks can be combined: one for the general setting, and one dedicated to the case where all the objects handled lie on a reference sphere. Finally, an assessment about the efficacy of the \sk\ is made through the calculation of the exact arrangement of circles on a sphere. On average …

Arrangements de cercles sur une sphère: Algorithmes et Applications aux modèles moléculaires representés par une union de boules

2008

Since the early work of Richard et al., geometric constructions havebeen paramount for the description of macromolecules and macro-molecularassemblies. In particular, Voronoï and related constructions have beenused to describe the packing properties of atoms, to compute molecularsurfaces, to find cavities. This thesis falls in this realm, andafter a brief introduction to protein structure, makes fourcontributions.First, using the sweep line paradigm of Bentley and Ottmann, wepresent the first effective algorithm able to construct the exactarrangement of circles on a sphere. Moreover, assuming the circlesstem from the intersection between spheres, we present a strategy to reportthe covering …